Automorphism groups of Grassmann codes
نویسندگان
چکیده
Article history: Received 9 May 2012 Revised 17 February 2013 Accepted 30 April 2013 Available online 14 May 2013 Communicated by Xiang-dong Hou MSC: 14M15 20B25 94B05 94B27
منابع مشابه
Automorphism groups of GRS codes
We look at AG codes associated to P1, re-examining the problem of determining their automorphism groups (originally investigated by Dür in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We classify those finite groups that can arise as the automorphism group of an AG code and give an explicit description of how these groups appear. We give examples of general...
متن کاملAutomorphism groups of generalized Reed-Solomon codes
We look at AG codes associated to P, re-examining the problem of determining their automorphism groups (originally investigated by Dür in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We classify those finite groups that can arise as the automorphism group of an AG code and give an explicit description of how these groups appear. We give examples of generali...
متن کاملIsometry groups of combinatorial codes
Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes, where these groups are the same, it is shown that for combinatorial codes the groups can be arbitrary different. Particularly, there exist codes with the fu...
متن کاملThe Automorphism Groups of BCH Codes and of Some Affine-Invariant Codes Over Extension Fields
Affine-invariant codes are extended cyclic codes of length pm invariant under the affine-group acting on Fpm . This class of codes includes codes of great interest such as extended narrow-sense BCH codes. In recent papers, we classified the automorphism groups of affine-invariant codes [2], [5]. We derive here new results, especially when the alphabet field is an extension field, by expanding o...
متن کاملMinimum distance of Symplectic Grassmann codes
In this paper we introduce Symplectic Grassmann codes, in analogy to ordinary Grassmann codes and Orthogonal Grassmann codes, as projective codes defined by symplectic Grassmannians. Lagrangian–Grassmannian codes are a special class of Symplectic Grassmann codes. We describe all the parameters of line Symplectic Grassmann codes and we provide the full weight enumerator for the Lagrangian–Grassm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 23 شماره
صفحات -
تاریخ انتشار 2013